Expressing infinity without foundation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The foundation for Buddhism without borders

Reflecting on the contemporary presentations of Buddhism within the Western context, particularly from the Tibetan traditions, this paper presents Buddhism from a ‘living tradition’ perspective arguing that the principle which links Buddhism across space and time is the concern with ‘lived experience.’ This perspective highlights the origins of Buddhism in the Buddha’s experience, and serves to...

متن کامل

Set Theory Without the Axiom of Foundation

Declaration I declare that this essay is work done as part of the Part III Examination. It is the result of my own work, and except where stated otherwise, includes nothing which was performed in collaboration. No part of this essay has been submitted for a degree or any such qualification. Self-reference has been a concept which has concerned philosophers for millennia, and which gives rise to...

متن کامل

Semilinear Equations in R N Without Condition at Infinity

In this paper we establish that some nonlinear elliptic (and parabolic) problems are well posed in all of R N without prescribing the behavior at infinity. A typical example is the following: Let 1 < p < oo. For every f ~ Laloc(R N) there is a unique u ~ L~o~(R N) satisfying Au + lulP-Xu = f ( x ) on R N.

متن کامل

Approximating Infinity-Dimensional Stochastic Darcy's Equations without Uniform Ellipticity

We consider a stochastic Darcy’s pressure equation whose coefficient is generated by a white noise process on a Hilbert space employing the ordinary (rather than the Wick) product. A weak form of this equation involves different spaces for the solution and test functions and we establish a continuous inf-sup condition and well-posedness of the problem. We generalize the numerical approximations...

متن کامل

Expressing Implicit Semantic Relations without Supervision

We present an unsupervised learning algorithm that mines large text corpora for patterns that express implicit semantic relations. For a given input word pair Y X : with some unspecified semantic relations, the corresponding output list of patterns m P P , , 1 is ranked according to how well each pattern i P expresses the relations between X and Y . For example, given ostrich = X and bird = Y ,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Symbolic Logic

سال: 1991

ISSN: 0022-4812,1943-5886

DOI: 10.2307/2275470